The complexity of approximately counting stable roommate assignments
نویسندگان
چکیده
منابع مشابه
The Complexity of Approximately Counting Stable Roommate Assignments
We investigate the complexity of approximately counting stable roommate assignments in two models: (i) the k-attribute model, in which the preference lists are determined by dot products of “preference vectors” with “attribute vectors” and (ii) the k-Euclidean model, in which the preference lists are determined by the closeness of the “positions” of the people to their “preferred positions”. Ex...
متن کاملThe Complexity of Approximately Counting Stable Matchings
We investigate the complexity of approximately counting stable matchings in the k-attribute model, where the preference lists are determined by dot products of “preference vectors” with “attribute vectors”, or by Euclidean distances between “preference points“ and “attribute points”. Irving and Leather [16] proved that counting the number of stable matchings in the general case is #P -complete....
متن کاملAbsolutely Stable Roommate Problems
Different solution concepts (core, stable sets, largest consistent set, ...) can be defined using either a direct or an indirect dominance relation. Direct dominance implies indirect dominance, but not the reverse. Hence, the predicted outcomes when assuming myopic (direct) or farsighted (indirect) agents could be very different. In this paper, we characterize absolutely stable roommate problem...
متن کاملApproximately counting cliques
We present a very simple, randomized approximation algorithm for determining the number of cliques in a random graph. Supported in part by NSF Grant CCR-9505448 and a UC Berkeley Faculty Research Grant
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2012
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2012.02.003